44 research outputs found
From Cycle Rooted Spanning Forests to the Critical Ising Model: an Explicit Construction
Fisher established an explicit correspondence between the 2-dimensional Ising
model defined on a graph and the dimer model defined on a decorated version
\GD of this graph \cite{Fisher}. In this paper we explicitly relate the dimer
model associated to the critical Ising model and critical cycle rooted spanning
forests (CRSFs). This relation is established through characteristic
polynomials, whose definition only depends on the respective fundamental
domains, and which encode the combinatorics of the model. We first show a
matrix-tree type theorem establishing that the dimer characteristic polynomial
counts CRSFs of the decorated fundamental domain \GD_1. Our main result
consists in explicitly constructing CRSFs of \GD_1 counted by the dimer
characteristic polynomial, from CRSFs of where edges are assigned
Kenyon's critical weight function \cite{Kenyon3}; thus proving a relation on
the level of configurations between two well known 2-dimensional critical
models.Comment: 51 pages, 24 figures. To appear, Comm. Math. Phys. Revised version:
title has changed. The terminology `correspondence' has been changed to that
of `explicit construction' and `mapping
Spiders for rank 2 Lie algebras
A spider is an axiomatization of the representation theory of a group,
quantum group, Lie algebra, or other group or group-like object. We define
certain combinatorial spiders by generators and relations that are isomorphic
to the representation theories of the three rank two simple Lie algebras,
namely A2, B2, and G2. They generalize the widely-used Temperley-Lieb spider
for A1. Among other things, they yield bases for invariant spaces which are
probably related to Lusztig's canonical bases, and they are useful for
computing quantities such as generalized 6j-symbols and quantum link
invariants.Comment: 33 pages. Has color figure
Birman-Wenzl-Murakami Algebra and the Topological Basis
In this paper, we use entangled states to construct 9x9-matrix
representations of Temperley-Lieb algebra (TLA), then a family of 9x9-matrix
representations of Birman-Wenzl-Murakami algebra (BWMA) have been presented.
Based on which, three topological basis states have been found. And we apply
topological basis states to recast nine-dimensional BWMA into its
three-dimensional counterpart. Finally, we find the topological basis states
are spin singlet states in special case.Comment: 11pages, 1 figur
On the Critical Temperature of Non-Periodic Ising Models on Hexagonal Lattices
The critical temperature of layered Ising models on triangular and honeycomb
lattices are calculated in simple, explicit form for arbitrary distribution of
the couplings.Comment: to appear in Z. Phys. B., 8 pages plain TEX, 1 figure available upon
reques
Space Saving by Dynamic Algebraization
Dynamic programming is widely used for exact computations based on tree
decompositions of graphs. However, the space complexity is usually exponential
in the treewidth. We study the problem of designing efficient dynamic
programming algorithm based on tree decompositions in polynomial space. We show
how to construct a tree decomposition and extend the algebraic techniques of
Lokshtanov and Nederlof such that the dynamic programming algorithm runs in
time , where is the maximum number of vertices in the union of
bags on the root to leaf paths on a given tree decomposition, which is a
parameter closely related to the tree-depth of a graph. We apply our algorithm
to the problem of counting perfect matchings on grids and show that it
outperforms other polynomial-space solutions. We also apply the algorithm to
other set covering and partitioning problems.Comment: 14 pages, 1 figur
Ordering of Energy Levels in Heisenberg Models and Applications
In a recent paper we conjectured that for ferromagnetic Heisenberg models the
smallest eigenvalues in the invariant subspaces of fixed total spin are
monotone decreasing as a function of the total spin and called this property
ferromagnetic ordering of energy levels (FOEL). We have proved this conjecture
for the Heisenberg model with arbitrary spins and coupling constants on a
chain. In this paper we give a pedagogical introduction to this result and also
discuss some extensions and implications. The latter include the property that
the relaxation time of symmetric simple exclusion processes on a graph for
which FOEL can be proved, equals the relaxation time of a random walk on the
same graph. This equality of relaxation times is known as Aldous' Conjecture.Comment: 20 pages, contribution for the proceedings of QMATH9, Giens,
September 200
Dimer coverings on the Sierpinski gasket with possible vacancies on the outmost vertices
We present the number of dimers on the Sierpinski gasket
at stage with dimension equal to two, three, four or five, where one of
the outmost vertices is not covered when the number of vertices is an
odd number. The entropy of absorption of diatomic molecules per site, defined
as , is calculated to be
exactly for . The numbers of dimers on the generalized
Sierpinski gasket with and are also obtained
exactly. Their entropies are equal to , , ,
respectively. The upper and lower bounds for the entropy are derived in terms
of the results at a certain stage for with . As the
difference between these bounds converges quickly to zero as the calculated
stage increases, the numerical value of with can be
evaluated with more than a hundred significant figures accurate.Comment: 35 pages, 20 figures and 1 tabl
Adsorption of Reactive Particles on a Random Catalytic Chain: An Exact Solution
We study equilibrium properties of a catalytically-activated annihilation reaction taking place on a one-dimensional chain of length () in which some segments (placed at random, with mean concentration
) possess special, catalytic properties. Annihilation reaction takes place,
as soon as any two particles land onto two vacant sites at the extremities
of the catalytic segment, or when any particle lands onto a vacant site on
a catalytic segment while the site at the other extremity of this segment is
already occupied by another particle. Non-catalytic segments are inert with
respect to reaction and here two adsorbed particles harmlessly coexist. For
both "annealed" and "quenched" disorder in placement of the catalytic segments,
we calculate exactly the disorder-average pressure per site. Explicit
asymptotic formulae for the particle mean density and the compressibility are
also presented.Comment: AMSTeX, 27 pages + 4 figure
Random skew plane partitions with a piecewise periodic back wall
Random skew plane partitions of large size distributed according to an
appropriately scaled Schur process develop limit shapes. In the present work we
consider the limit of large random skew plane partitions where the inner
boundary approaches a piecewise linear curve with non-lattice slopes,
describing the limit shape and the local fluctuations in various regions. This
analysis is fairly similar to that in [OR2], but we do find some new behavior.
For instance, the boundary of the limit shape is now a single smooth (not
algebraic) curve, whereas the boundary in [OR2] is singular. We also observe
the bead process introduced in [B] appearing in the asymptotics at the top of
the limit shape.Comment: 24 pages. This version to appear in Annales Henri Poincar
Entropy of chains placed on the square lattice
We obtain the entropy of flexible linear chains composed of M monomers placed
on the square lattice using a transfer matrix approach. An excluded volume
interaction is included by considering the chains to be self-and mutually
avoiding, and a fraction rho of the sites are occupied by monomers. We solve
the problem exactly on stripes of increasing width m and then extrapolate our
results to the two-dimensional limit to infinity using finite-size scaling. The
extrapolated results for several finite values of M and in the polymer limit M
to infinity for the cases where all lattice sites are occupied (rho=1) and for
the partially filled case rho<1 are compared with earlier results. These
results are exact for dimers (M=2) and full occupation (\rho=1) and derived
from series expansions, mean-field like approximations, and transfer matrix
calculations for some other cases. For small values of M, as well as for the
polymer limit M to infinity, rather precise estimates of the entropy are
obtained.Comment: 6 pages, 7 figure